Algebraic multigrid (AMG) for saddle point systems from meshfree discretizations
نویسندگان
چکیده
Meshfree discretizations construct approximate solutions to partial differential equation based on particles, not on meshes, so that it is well suited to solve the problems on irregular domains. Since the nodal basis property is not satisfied in meshfree discretizations, it is difficult to handle essential boundary conditions. In this paper, we employ the Lagrange multiplier approach to solve this problem, but this will result in an indefinite linear system of a saddle point type. We adapt a variation of the smoothed aggregation AMG method of Vaněk, Mandel & Brezina to this saddle point system. We give numerical results showing that this method is practical and competitive with other methods with convergence rates that are ∼ c/ logN . Copyright c © 2003 John Wiley & Sons, Ltd.
منابع مشابه
H-matrix preconditioners for saddle-point systems from meshfree discretization∗
In this paper we describe and compare preconditioners for saddle-point systems obtained from meshfree discretizations, using the concepts of hierarchical (or H-)matrices. Previous work by the authors using this approach did not use H-matrix techniques throughout, as is done here. Comparison shows the method described here to be better than the author’s previous method, an AMG method adapted to ...
متن کاملH - matrix preconditioners for saddle - point systems from meshfree discretization 1
In this paper we describe and compare preconditioners for saddle-point systems obtained from meshfree discretizations, using the concepts of hierarchical (or H )matrices. Previous work by the authors using this approach did not use H -matrix techniques throughout, as is done here. Comparison shows the method described here to be better than the author’s previous method, an AMG method adapted to...
متن کاملAlgebraic multigrid within defect correction for the linearized Euler equations
Given the continued difficulty of developing geometric multigrid methods that provide robust convergence for unstructured discretizations of compressible flow problems in aerodynamics, we turn to algebraic multigrid (AMG) as an alternative with the potential to automatically deal with arbitrary sources of stiffness on unstructured grids. We show here that AMG methods are able to solve linear pr...
متن کاملAlgebraic Multigrid for Discontinuous Galerkin Discretizations
We present a new algebraic multigrid (AMG) algorithm for the solution of linear systems arising from discontinuous Galerkin discretizations of heterogeneous elliptic problems. The algorithm is based on the idea of subspace corrections and the first coarse level space is the subspace spanned by continuous linear basis functions. The linear system associated with this space is constructed algebra...
متن کاملAn Algebraic Multigrid Approach Based on a Compatible Gauge Reformulation of Maxwell's Equations
With the rise in popularity of compatible finite element, finite difference and finite volume discretizations for the time domain eddy current equations, there has been a corresponding need for fast solvers of the resulting linear algebraic systems. However, the traits that make compatible discretizations a preferred choice for the Maxwell’s equations also render these linear systems essentiall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 11 شماره
صفحات -
تاریخ انتشار 2004